Lengths of quasi-commutative pairs of matrices
نویسندگان
چکیده
In this paper we discuss some partial solutions of the length conjecture which describes the length of a generating system for matrix algebras. We consider mainly the algebras generated by two matrices which are quasi-commuting. It is shown that in this case the length function is linearly bounded. We also analyze which particular natural numbers can be realized as the lengths of certain special generating sets and prove that for commuting or product-nilpotent pairs all possible numbers are realizable, however there are non-realizable values between lower and upper bounds for the other quasi-commuting pairs. In conclusion we also present several related open problems.
منابع مشابه
Commuting Pairs and Triples of Matrices and Related Varieties
In this note, we show that the set of all commuting d-tuples of commuting n × n matrices that are contained is an n-dimensional commutative algebra is a closed set, and therefore, Gerstenhaber’s theorem on commuting pairs of matrices is a consequence of the irreducibility of the variety of commuting pairs. We show that the variety of commuting triples of 4×4 matrices is irreducible. We also stu...
متن کاملQuasi-cyclic codes as codes over rings of matrices
Quasi cyclic codes over a finite field are viewed as cyclic codes over a non commutative ring of matrices over a finite field. This point of view permits to generalize some known results about linear recurring sequences and to propose a new construction of some quasi cyclic codes and self dual codes.
متن کاملPairs of Matrices with Property L(0
1. It was proved by Frobenius [l] that any function f(A, B) of two commutative «X« square matrices A, B has as characteristic roots the numbers /(X¿, Hi) where X¿ are the characteristic roots of A and pi the characteristic roots of B, both taken in a special ordering independent of the function /. However, commutativity of A and B is known not to be a necessary condition [2]. Matrices which hav...
متن کاملOn binary codes related to mutually quasi-unbiased weighing matrices
Some mutually quasi-unbiased weighing matrices are constructed from binary codes satisfying the conditions that the number of non-zero weights of the code is four and the code contains the first order Reed–Muller code. Motivated by this, in this note, we study binary codes satisfying the conditions. The weight distributions of binary codes satisfying the conditions are determined. We also give ...
متن کاملMatrix representations of trace monoids
We consider trace monoids i.e., free monoids where some pairs of letters are allowed to commute. We show that such monoids can be faithfully represented by 22-matrices with integer entries if and only if it they are direct products of a free commutative monoid with a free product of free commutative monoids.
متن کامل